منابع مشابه
An Efficient Parallel String Matching Algorithm Based on DFA
The classical string matching algorithms are facing a great challenge on speed due to the rapid growth of information on Internet. Meanwhile, multicore CPU has been widespread on computers. But classical string matching algorithms does not apply to multi-core CPU flexibly. It not only affects the run-time speed, but also makes a waste of the resource on CPU. In this paper, we proposed a paralle...
متن کاملChinese String Searching Using The KMP Algorithm
This paper is about the modification of KMP (Knuth, Morris and Pratt) algorithm for string searching of Chinese text. The difficulty is searching through a text string of singleand multi-byte characters. We showed that proper decoding of the input as sequences of characters instead of bytes is necessary. The standard KMP algorithm can easily be modified for Chinese string searching but at the w...
متن کاملNew Enhanced Exact String Searching Algorithm
Exact string Searching is one of the most important problems that had been investigated by many studies ranging from finding the shortest common super string in DNA sequencing to searching for occurrences of a pattern occurs in text editors. In this paper, a new Enhanced Checking and Skipping Algorithm (ECSA) is introduced. The new algorithm enhance the classical string searching algorithms by ...
متن کاملA Parallel DFA Minimization Algorithm
In this paper, we have considered the state minimization problem for Deterministic Finite Automata (DFA). An efficient parallel algorithm for solving the problem on an arbitrary CRCW PRAM has been proposed. For n number of states and k number of inputs in Σ of the DFA to be minimized, the algorithm runs in O(kn log n) time and uses O( n log n ) processors.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Information Systems
سال: 2015
ISSN: 2249-0868
DOI: 10.5120/ijais2015451415